Some Properties of Finitely Decidable Varieties
نویسندگان
چکیده
Let V be a variety whose class of finite members has a decidable first-order theory. We prove that each finite member A of V satisfies the (3,1) and (3,2) transfer principles, and that the minimal sets of prime quotients of type 2 or 3 in A must have empty tails. The first result has already been used by J. Jeong [9] in characterizing the finite subdirectly irreducible members of V with nonabelian monolith. The second result implies that if V is also locally finite and omits type 1, then V is congruence modular.
منابع مشابه
On Solvable Congruences in Finitely Decidable Varieties
In this paper we establish the (1, 2) and (2, 1)-transfer principles for finitely decidable locally finite varieties. A class of structures is finitely decidable if the first order theory of its finite members is recursive. A variety is a class of algebras which is axiomatizable by a set of equations. The transfer principles deal with the local structure of finite algebras and have strong globa...
متن کاملA Characterization of Decidable Locally Finite Varieties
We describe the structure of those locally finite varieties whose first order theory is decidable. A variety is a class of universal algebras defined by a set of equations. Such a class is said to be locally finite if every finitely generated member of the class is finite. It turns out that in order for such a variety to have a decidable theory it must decompose into the varietal product of thr...
متن کاملFinitely Decidable Congruence Modular Varieties
A class TZ~ of algebras of the same type is said to be finitely decidable iff the first order theory of the class of finite members of 'V is decidable. Let y be a congruence modular variety. In this paper we prove that if "V is finitely decidable, then the following hold. (1) Each finitely generated subvariety of 2^ has a finite bound on the cardinality of its subdirectly irreducible members. (...
متن کاملFinitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms
We show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. As a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. This consequence also implies that it is decidable whether a given finite...
متن کاملDecidable properties of logical calculi and of varieties of algebras
We give an overview of decidable and strongly decidable properties over the propositional modal logics K, GL, S4, S5 and Grz, and also over the intuitionistic logic Int and the positive logic Int+. We consider a number of important properties of logical calculi: consistency, tabularity, pretabularity, local tabularity, various forms of interpolation and of the Beth property. For instance, consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 2 شماره
صفحات -
تاریخ انتشار 1992